Non-combinatorial estimation of independent autoregressive sources
نویسندگان
چکیده
Identification of mixed independent subspaces is thought to suffer from combinatorial explosion of two kinds: the minimization of mutual information between the estimated subspaces and the search for the optimal number and dimensions of the subspaces. Here we show that independent auto-regressive process analysis, under certain conditions, can avoid this problem using a two-phase estimation process. We illustrate the solution by computer demonstration.
منابع مشابه
Modified Maximum Likelihood Estimation in First-Order Autoregressive Moving Average Models with some Non-Normal Residuals
When modeling time series data using autoregressive-moving average processes, it is a common practice to presume that the residuals are normally distributed. However, sometimes we encounter non-normal residuals and asymmetry of data marginal distribution. Despite widespread use of pure autoregressive processes for modeling non-normal time series, the autoregressive-moving average models have le...
متن کاملA unifying model for blind separation of independent sources
Many algorithms have been proposed for blind separation of statistically independent sources. Most of the algorithms are based on one of the following properties: nongaussianity of the sources, their different autocorrelations, or their smoothly changing nonstationary variances. Each of the methods is able to separate sources if the respective assumptions are met. Here we propose a simple unify...
متن کاملNeurally plausible, non-combinatorial iterative independent process analysis
It has been shown recently that the identi cation of mixed hidden independent autoregressive processes (Independent Process Analysis, IPA), under certain conditions, can be free from combinatorial explosion. The key is that IPA can be reduced (i) to Independent Subspace Analysis and then, via a novel decomposition technique called Separation Theorem, (ii) to Independent Component Analysis. Here...
متن کاملEstimation of Sparse Non-negative Sources from Noisy Overcomplete
In this paper, a new algorithm for estimating sparse non-negative sources from a set of noisy linear mixtures is proposed. In particular, difficult situations with high noise levels and more sources than sensors (underdetermined case) are considered. It is shown that, when sources are very sparse in time and overlapped at some locations, they can be recovered even with very low SNR and by using...
متن کاملEstimation of Source Location Using Curvature Analysis
A quadratic surface can be fitted to potential-field data within 3×3 windows, which allow us to calculate curvature attributes from its coefficients. Phillips (2007) derived an equation depending on the most negative curvature to obtain the depth and structural index of isolated sources from peak values of special functions. They divided the special functions into two categories: Model-specific...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Neurocomputing
دوره 69 شماره
صفحات -
تاریخ انتشار 2006